Generalized Quantum Turing Machine and its Application to the SAT Chaos Algorithm
نویسندگان
چکیده
Ohya and Volovich have proposed a new quantum computation model with chaotic amplification to solve the SAT problem, which went beyond usual quantum algorithm. In this paper, we generalize quantum Turing machine, and we show in this general quantum Turing machine (GQTM) that we can treat the Ohya-Volovich (OV) SAT algorithm.
منابع مشابه
On generalized quantum Turing machine and its language classes
Ohya and Volovich have proposed a new quantum computation model with chaotic amplification to solve the SAT problem, which went beyond usual quantum algorithm. In this paper, we generalize quantum Turing machine by rewriting usual quantum Turing machine in terms of channel transformation. Moreover, we define some computational classes of generalized quantum Turing machine and show that we can t...
متن کاملNew quantum algorithm for studying NP-complete problems
Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm which is a combination of the ordinary quantum algorithm with a chaotic dynamical system. We consider the satisfiability problem as an example of NP-complete ...
متن کاملQuantum chaos in quantum Turing machines
We investigate a 2-spin quantum Turing architecture, in which discrete local rotations αm of the Turing head spin alternate with quantum controlled NOT-operations. We demonstrate that a single chaotic parameter input αm leads to a chaotic dynamics in the entire Hilbert-space.
متن کاملMathematical Characterization of Quantum Algorithm
We have studied quantum computation for many years, and defined the generalized quantum Turing machine by using completely positive channels and density operators on the Hilbert space. This mathematical model of quantum algorithm gives us the new language classes in which the class NP is included in a polynomial time class. It has also a possibility to expand the theory of computability which h...
متن کاملQuantum chaos in small quantum networks
We study a 2-spin quantum Turing architecture, in which discrete local rotations {αm} of the Turing head spin alternate with quantum controlled NOT-operations. We show that a single chaotic parameter input {αm} leads to a chaotic dynamics in the entire Hilbert space. The instability of periodic orbits on the Turing head and ‘chaos swapping’ onto the Turing tape are demonstrated explicitly as we...
متن کامل